Quantum CPOs
نویسندگان
چکیده
We introduce the monoidal closed category qCPO of quantum cpos, whose objects are "quantized" analogs omega-complete partial orders (cpos). The is enriched over CPO and contains both CPO, opposite FdAlg finite-dimensional von Neumann algebras as subcategories. use to construct a sound model for programming language Proto-Quipper-M (PQM) extended with term recursion, well computationally adequate Linear/Non-Linear Fixpoint Calculus (LNL-FPC), which an extension (FPC) linear types, circuit-free fragment PQM that includes recursive types.
منابع مشابه
Studying repleteness in the category of cpos
We consider the notion of replete object in the category of directed complete partial orders and Scott-continuous functions, and show that, contrary to previous expectations, there are non-replete objects. The same happens in the case of ω-complete posets. Synthetic Domain Theory developed from an idea of Dana Scott: it is consistent with intuitionistic set theory that all functions between dom...
متن کاملClosures on CPOs Form Complete Lattices
It is well known that closure operators on a complete lattice, ordered pointwise, give rise to a complete lattice, and this basic fact plays an important rôle in many fields of the semantics area, notably in domain theory and abstract interpretation. We strengthen that result by showing that closure operators on any directed-complete partial order (CPO) still form a complete lattice. An example...
متن کاملTwo categories of effective continuous cpos
This paper presents two categories of effective continuous cpos. We define a new criterion on the basis of a cpo as to make the resulting category of consistently complete continuous cpos cartesian closed. We also generalise the definition of a complete set, used as a definition of effective bifinite domains in [HSH02], and investigate what closure results that can be obtained.
متن کامل8 Eeective Cpos over Lambda Terms
In this paper, we have developed and analysed per models for recursive types, polymorphism, and subtyping. In developing our models, the emphasis has been on simplicity and on understanding the necessity of any conditions we impose on our structures. While similar structures have been given using the interpretation of constructive logic in a topos, the presentation of the models here is more di...
متن کاملLower and Upper Power Domain Constructions Commute on all Cpos
The initial lower and upper power domain constructions P _ and P ^ commute under composition for all cpos. The common result P _ (P ^ X) and P ^ (P _ X) is the free frame over the cpo X.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2021
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.340.9